Euclidean minimum spanning tree - PDFSEARCH.IO - Document Search Engine

Euclidean minimum spanning tree
Results: 19

#	Item
11	1991: The Steiner Tree Problem: The Steiner Tree Problem Add to Reading List Source URL: www.comap.com Language: English - Date: 2014-07-31 15:13:23 NP-complete problems Spanning tree Steiner tree problem Minimum spanning tree Euclidean geometry Distance Operations research Rectilinear Steiner tree Graph theory Theoretical computer science Mathematics
12	Efficient Construction of a Bounded Degree Spanner with Low Weight Sunil Arya∗ Michiel Smid∗ Add to Reading List Source URL: www.cse.ust.hk Language: English - Date: 2006-04-04 05:27:07 Minimum spanning tree Spanning tree Euclidean plane geometry Computational geometry Combinatorics Beta skeleton Geometry Mathematics Trigonometry
13	Euclidean Spanners: Short, Thin, and Lanky Sunil Arya Gautam Dasy Add to Reading List Source URL: www.cse.ust.hk Language: English - Date: 2006-04-06 21:38:27 Minimum spanning tree Tree decomposition Connectivity Tree Planar separator theorem Graph theory Spanning tree Geometric spanner
14	All closest neighbors are proper Delaunay edges generalized, and its application to parallel algorithms Arne Maus Jon Moen Drange {arnem,[removed]} Add to Reading List Source URL: www.nik.no Language: English - Date: 2010-10-01 06:27:48 Delaunay triangulation Gabriel graph Proximity problems Pitteway triangulation Euclidean minimum spanning tree Triangulation Geometry Mathematics
15	OUTPUT-SENSITIVE ALGORITHMS FOR COMPUTING NEAREST-NEIGHBOUR DECISION BOUNDARIES∗ David Bremner† Erik Demaine‡ Pat Morin∗∗ Add to Reading List Source URL: john2.poly.edu Language: English - Date: 2007-12-27 15:24:28 Computational geometry Combinatorics Delaunay triangulation Convex hull algorithms Quicksort Convex hull Boundary Euclidean minimum spanning tree Pitteway triangulation Triangulation Geometry Mathematics
16	Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries? David Bremner1 , Erik Demaine2 , Jeff Erickson3 , John Iacono4 , Stefan Langerman5 , Pat Morin6 , and Godfried Toussaint7 1 Add to Reading List Source URL: john2.poly.edu Language: English - Date: 2007-12-27 15:24:59 Theoretical computer science Computational geometry Delaunay triangulation Voronoi diagram Quicksort Convex hull algorithms Convex hull Time complexity Euclidean minimum spanning tree Geometry Mathematics Triangulation
17	Minimum weight pseudo-triangulations (Extended Abstract) Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2004-08-30 04:36:47 Euclidean plane geometry Simple polygon Pseudotriangle Polygon Minimum-weight triangulation Minimum spanning tree Polygon triangulation Art gallery problem Geometry Polygons Triangulation
18	PDF Document Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 1999-07-26 14:14:46 Spanning tree NP-complete problems Euclidean minimum spanning tree Minimum spanning tree Delaunay triangulation Relative neighborhood graph Steiner tree problem Closest pair of points problem Planar graph Graph theory Theoretical computer science Mathematics
19	PDF Document Add to Reading List Source URL: www.cs.uu.nl Language: English - Date: 2001-02-22 04:48:28 Delaunay triangulation Euclidean minimum spanning tree Gabriel graph Graph Planar graph Relative neighborhood graph Nearest neighbor graph Neighbourhood Graph theory Triangulation Euclidean plane geometry